paths searched造句
例句與造句
- Then a algorithm is applied for shortest path search
然后利用a ~ *算法實現(xiàn)最短路徑搜索。 - Thirdly , the technology of paths searched plan is discussed
接著，本文討論了搜索路徑規(guī)劃技術(shù)。 - Integrated processing strategies for spatial query and path search
空間查詢和路徑搜索的集成處理策略 - Forward and backward path searching methods were achieved . the trajectory is displayed on screen with 2d and / or 3d method
在軌跡顯示上,既可以在二維地圖上,同時也可以在三維空間中顯示出直升機的運動軌跡。 - Abstract : a path searching algorithm using contour is presented to obtain the shortest path between two points on a curved surface under the slope constraint
文摘:給出了一種基于等高線求解坡度約束下曲面上兩點間最短路徑的搜索算法。 - It's difficult to find paths searched in a sentence. 用paths searched造句挺難的
- Using heuristic search theory for reference , this paper presented the concept of heuristic paths searched plan technology for the mapping system
文中借鑒人工智能理論中的啟發(fā)式搜索思想，提出了標(biāo)圖系統(tǒng)中的啟發(fā)式搜索路徑規(guī)劃的概念。 - It can be extended to fuzzy logic systems and some lattice - valued logic systems . 3 . the study on automated reasoning a new automated reasoning method based on path searching was proposed
2 、提出一種利用神經(jīng)邏輯單元動態(tài)地構(gòu)造神經(jīng)網(wǎng)絡(luò)的算法來對一些邏輯系統(tǒng)中的邏輯公式的真值進行計算。 - On the further study of image vectorization principle , an auto - adapting adjust approach based on direction module is proposed to track image edges , which optimized paths searched
研究了基于圖像邊緣矢量化原理，提出了基于方向模塊的自適應(yīng)調(diào)節(jié)方法，對圖像邊緣進行跟蹤，優(yōu)化了輪廓搜索路徑。 - For video images with moving objects , an optimal stitching line was found by heuristic optimal path search algorithm in mosaics of images , and the images were smoothed by multi resolution theory after mosaics of images
對存在運動物體的視頻圖像，采用啟發(fā)式最優(yōu)路徑搜索算法尋找到圖像間拼接的最佳縫合線，并使用多分辨率原理進行圖像拼接后的平滑處理。 - During the realization of integration optimization , based on former integration scheme relation drawings , paper brings forward the integration scheme optimize - path searching algorithm and self - optimize algorithm and gets the integration scheme objects ensemble which is
在聚集優(yōu)化的實現(xiàn)當(dāng)中，本文基于原聚集方案關(guān)系圖，提出了一種聚集方案最優(yōu)尋徑算法與自身優(yōu)化算法，從而得到一個聚集代價較低，又能夠滿足當(dāng)前用戶需求的聚集方案實體化集合。 - In order to meet the need of flexibility in the logistics network planning , the network constructing algorithm based on the idea of dynamic programming and the approximation algorithm for the shortest path search based on the dynamic programming are also proposed as the basis of above mentioned algorithms
為了滿足物流網(wǎng)絡(luò)規(guī)劃的敏捷性要求，作為以上算法的基礎(chǔ)，還提出了基于動態(tài)規(guī)劃思想的網(wǎng)絡(luò)圖構(gòu)建算法和基于動態(tài)規(guī)劃思想的最短路搜索的近似算法。 - Because ga possesses the traits of can global random search , the robustness is strong , been use briefly and broadly , it didn ’ t use path search , and use probability search , didn ’ t care inherence rule of problem itself , can search the global optimum points effectively and rapidly in great vector space of complicated , many peak values , cannot differentiable . so it can offset the shortages of nn study algorithm , can reduce the possibility that the minimum value get into local greatly , the speed of convergence can improve , interpolation time shorten greatly , the quantity of training reduce
因為遺傳算法具有全局隨機搜索能力,魯棒性強、使用簡單和廣泛的特點,它不采用路徑搜索,而采用概率搜索,不用關(guān)心問題本身的內(nèi)在規(guī)律,能夠在復(fù)雜的、多峰值的、不可微的大矢量空間中迅速有效地尋找到全局最優(yōu)解,所以可以彌補神經(jīng)網(wǎng)絡(luò)學(xué)習(xí)算法的不足,使陷入局部最小值的可能性大大減少,使得收斂速度提高,訓(xùn)練量減小。 - ( 2 ) to adapt the requirement of dw individuation and respond to the need of dw change , based on the optimization function of the current dw production , paper brings forward dw integration optimize - path searching algorithm and the dw integration scheme self - optimize algorithm , and studies and realizes the dw integration optimization
( 2 )為適應(yīng)數(shù)據(jù)倉庫的個性化要求，響應(yīng)用戶對數(shù)據(jù)倉庫的需求，本文基于現(xiàn)有產(chǎn)品的數(shù)據(jù)倉庫優(yōu)化功能，提出了數(shù)據(jù)倉庫聚集方案最優(yōu)尋徑算法，與數(shù)據(jù)倉庫聚集方案自身優(yōu)化算法，研究并實現(xiàn)了數(shù)據(jù)倉庫聚集優(yōu)化。 - Then , taking the parking space detecting system as the foundation , the problem of shortest path searching based on genetic algorithm is discussed . combining the database and information display device , automatic parking - guiding system is proposed . the presentation of humanization information , not only has facilitated customers but also improved the actual utilization rate of parking spaces
然后,以車位檢測系統(tǒng)為基礎(chǔ),對基于遺傳算法的停車場最短泊車路徑搜索問題進行了研究,并結(jié)合數(shù)據(jù)庫和信息顯示設(shè)備,對自動泊車引導(dǎo)系統(tǒng)進行了設(shè)計,人性化的信息提示,不但方便了顧客,也提高了停車場車位實際使用率。 - It has small diameter , strong expansibility , symmetrical structure and simple path searching algorithms , etc . , what more , many interconnection networks with different topologies can be easily embedded in it . so it becomes one of the most important and attractive network models . in this thesis , based on the above two aspects , the fault - tolerance and routing algorithms of the hypercube are studied
超立方體網(wǎng)絡(luò)是多處理機系統(tǒng)中常見的一種互連網(wǎng)絡(luò),這種網(wǎng)絡(luò)拓撲結(jié)構(gòu)由于具有直徑小、可擴展性強、結(jié)構(gòu)對稱、網(wǎng)絡(luò)尋路算法簡單等優(yōu)點,且多種拓撲結(jié)構(gòu)的互連網(wǎng)絡(luò)都可以很容易的嵌入其中,因而成為最重要和最具吸引力的網(wǎng)絡(luò)模型之一。
更多例句： 下一頁